Journals
  Publication Years
  Keywords
Search within results Open Search
Please wait a minute...
For Selected: Toggle Thumbnails
Improved certificate-based aggregate proxy signature scheme
ZUO Liming, GUO Hongli, ZHANG Tingting, CHEN Zuosong
Journal of Computer Applications    2016, 36 (10): 2758-2761.   DOI: 10.11772/j.issn.1001-9081.2016.10.2758
Abstract378)      PDF (708KB)(375)       Save
The analysis of aggregate proxy signature scheme proposed by Yu et al. (YU X Y, HE D K. A certificate-based aggregate proxy signature scheme. Journal of Central South University (Science and Technology), 2015, 46(12): 4535-4541.) showed that a valid signatures could be forged for any messages while knowing a valid signature. Therefore, an improved certificate-based aggregate proxy signature scheme was proposed and a new attack model was given. The new scheme was proved to be existentially unforgeable for the new attacker in random oracle model. The results show that the proposed scheme can resist conspiracy attacks and forgery attacks, and it is more suitable for the computation-constrained and real-time tasks.
Reference | Related Articles | Metrics
Regional cluster-based lifetime optimization strategy for large-scale wireless sensor networks
WANG Yan, ZHANG Tingting, SONG Zhirun, WANG Junlu, GUO Jingyu
Journal of Computer Applications    2015, 35 (11): 3031-3037.   DOI: 10.11772/j.issn.1001-9081.2015.11.3031
Abstract415)      PDF (1095KB)(709)       Save
In view of the characteristics of wide monitoring area and large number of sensors in large-scale monitoring systems like environment monitoring and power grid ice-disaster monitoring system, a Regional Cluster-based lifetime optimization Strategy for large-scale wireless sensor network (RCS) was proposed to save the network energy consumption and prolong the lifetime of the network. The strategy firstly used AGNES (Agglomerative Nesting) algorithm to divide the network into several subareas based on node location for optimizing the distribution of cluster heads. Secondly, uneven clusters would be conducted after cluster heads were generated, and a time threshold value was set to balance node energy consumption. Finally, for inter-cluster communication, a multi-hop routing was adopted by constructing minimum spanning tree on the basis of calculating network energy cost to balance the energy consumption of the cluster heads. In the simulation, compared with LEACH (Low Energy Adaptive Clustering Hierarchy) and EEUC (Energy-Efficient Uneven Clustering) algorithm, RCS respectively reduced the cluster head nodes' energy consumption by 45.1% and 2.4% on average; and respectively extend the network lifetime by 38% and 3.7%.The simulation results show that RCS can be more efficient to balance the overall network energy consumption, and significantly prolong the network lifetime.
Reference | Related Articles | Metrics